Improving Jacobi and Gauss-Seidel Iterations
نویسندگان
چکیده
منابع مشابه
A Comparison of Jacobi and Gauss-Seidel Parallel Iterations
We consider an iterative algorithm in which several components are updated in parallel at each stage. We assume that the underlying iteration mapping is monotone and we show that the speed of convergence is maximized when all components are updated at each iteration.
متن کاملSome p-norm convergence results for Jacobi and Gauss-Seidel iterations
Let A be a matrix such that the diagonal matrix D with the same diagonal as A is invertible. It is well known that if (1) A satisfies the Sassenfeld condition then its Gauss-Seidel scheme is convergent, and (2) if D−1A certifies certain classical diagonal dominance conditions then the Jacobi iterations for A are convergent. In this paper we generalize the second result and extend the first resu...
متن کاملA PageRank Algorithm based on Asynchronous Gauss-Seidel Iterations
We address the PageRank problem of associating a relative importance value to all web pages in the Internet so that a search engine can use them to sort which pages to show to the user. This precludes finding the eigenvector associated with a particular eigenvalue of the link matrix constructed from the topology graph of the web. In this paper, we investigate the potential benefits of addressin...
متن کاملHigher Order Aitken Extrapolation with Application to Converging and Diverging Gauss-Seidel Iterations
In this paper Aitken’s extrapolation normally applied to convergent fixed point iteration is extended to extrapolate the solution of a divergent iteration. In addition, higher order Aitken extrapolation is introduced that enables successive decomposition of high Eigen values of the iteration matrix to enable convergence. While extrapolation of a convergent fixed point iteration using a geometri...
متن کاملA Unified Proof for the Convergence of Jacobi and Gauss-Seidel Methods
We present a new unified proof for the convergence of both the Jacobi and the Gauss–Seidel methods for solving systems of linear equations under the criterion of either (a) strict diagonal dominance of the matrix, or (b) diagonal dominance and irreducibility of the matrix. These results are well known. The proof for criterion (a) makes use of Geršgorin’s theorem, while the proof for criterion (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1987
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(87)90321-1